Consecutive patterns in Catalan words and the descent distribution

نویسندگان

چکیده

Abstract In this paper, we compute the distribution of descent statistic on Catalan words avoiding a consecutive pattern length at most three. Baril–Kirgizov–Vajnovszki began study patterns in words, focusing enumeration those that avoid classical 3. We make use symbolic method to associate functional equations satisfied by counting generating functions. As consequence enumerate set 3, and also provide total number descents set.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Descent distribution on Catalan words avoiding a pattern of length at most three

Catalan words are particular growth-restricted words over the set of non-negative integers, and they represent still another combinatorial class counted by the Catalan numbers. We study the distribution of descents on the sets of Catalan words avoiding a pattern of length at most three: for each such a pattern p we provide a bivariate generating function where the coefficient of xy in its serie...

متن کامل

Permutations and words counted by consecutive patterns

Generating functions which count occurrences of consecutive sequences in a permutation or a word which matches a given pattern are studied by exploiting the combinatorics associated with symmetric functions. Our theorems take the generating function for the number of permutations which do not contain a certain pattern and give generating functions refining permutations by the both the total num...

متن کامل

The descent of words.

The word for “sky” in the indigenous Saaroa language of Taiwan is lasica. Across the South China Sea in the Philippines, the speakers of Ilonggo use lasit, whereas, on the far-flung islands of the Pacific, Hawaiians say lani and Rarotongans and New Zealand Maori rasi (1). Systematic sound correspondences between many such words tell us that these languages have evolved from a common ancestor to...

متن کامل

On a New Collection of Words in the Catalan Family

In this note, we provide a bijection between a new collection of words on nonnegative integers of length n and Dyck paths of length 2n− 2, thus proving that this collection belongs to the Catalan family. The surprising key step in this bijection is the zeta map which is an important map in the study of q, t-Catalan numbers. Finally we discuss an alternative approach to this new collection of wo...

متن کامل

Descent Patterns in Permutations

We consider the problem of finding generating functions for permutations which contain a given descent set. We expand on recent work of Remmel and Riehl, who developed a systematic way to find generating functions for permutations which contain a given finite descent set S, by showing that in many cases we can find generating functions for permutations σ in the symmetric group Sn whose descent ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Boletin De La Sociedad Matematica Mexicana

سال: 2023

ISSN: ['2296-4495', '1405-213X']

DOI: https://doi.org/10.1007/s40590-023-00532-0